Formal Veriication of Connict Detection Algorithms

نویسندگان

  • Ricky Butler
  • Gilles Dowek
چکیده

Safety assessment of new air traac management systems is a main issue for civil aviation authorities. Standard techniques such as testing and simulation have serious limitations in new systems that are signiicantly more autonomous than the older ones. In this paper, we present an innovative approach for establishing the correctness of con-ict detection systems. Fundamental to our approach is the concept of trajectory, which is described by a continuous path in the x-y plane constrained by physical laws and operational requirements. From the model of trajectories, we extract, and formally prove, high level properties that can serve as a framework to analyze connict scenarios. We use the AILS (Airborne Information for Lateral Spacing) alerting algorithm as a case study of our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Probabilistic Framework for Aircraft Connict Detection

In this paper we describe a general connict detection/resolution scheme for a pair of aircraft ying at the same altitude, focusing on the connict detection component. The proposed approach is formulated in a probabilistic framework, thus allowing uncertainty in the aircraft positions to be explicitly taken into account when detecting a potential connict. The computational issues involved in the...

متن کامل

The Formal Verification of an Algorithm for Interactive Consistency under a Hybrid Fault Model

Modern veriication systems such as PVS are now reaching the stage of development where the formal veriication of critical algorithms is feasible with reasonable eeort. This paper describes one such veriication in the eld of fault tolerance. The distribution of single-source data to replicated computing channels (Interactive Consistency or Byzantine Agreement) is a central problem in this eld. T...

متن کامل

Consistency Rules IN - Service View Executable Prototype Synthesis Compilation Abstraction

This paper presents a Service Creation Environment which is unique in featuring formal verii-cation of global correctness and consistency as well as abstract views. The veriication guarantees frame conditions for the design, concerning implementability, country speciic standards , and network speciic features. Abstract views focus the development process, and support error correction. The descr...

متن کامل

HSIS: A BDD-Based Environment for Formal Veri cation

Functional and timing veriication are currently the bottlenecks in many design eeorts. Simulation and emulation are extensively used for veriication. Formal veriication is now gaining acceptance in advanced design groups. This has been facilitated by the use of binary decision diagrams (BDDs). This paper describes the essential features of HSIS, a BDD-based environment for formal veriication: 1...

متن کامل

Formal Veri cation of Distributed Deadlock Detection Algorithm Using a Time-dependent Proof Technique

A large number of published distributed deadlock detection/resolution algorithms are found to be incorrect because they have used informal approaches to prove the correctness of their algorithms. In this paper, we present a formal approach for the correctness proof and give an example of the proof. In this proposed approach, a formal model of distributed deadlock is presented with a local-time ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009